On the Variable Hierarchy of First-Order Spectra

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On the first variable Zagreb index

‎The first variable Zagreb index of graph $G$ is defined as‎ ‎begin{eqnarray*}‎ ‎M_{1,lambda}(G)=sum_{vin V(G)}d(v)^{2lambda}‎, ‎end{eqnarray*}‎ ‎where $lambda$ is a real number and $d(v)$ is the degree of‎ ‎vertex $v$‎. ‎In this paper‎, ‎some upper and lower bounds for the distribution function and expected value of this index in random increasing trees (rec...

متن کامل

On the Mints Hierarchy in First-Order Intuitionistic Logic

We stratify intuitionistic first-order logic over (∀,→) into fragments determined by the alternation of positive and negative occurrences of quantifiers (Mints hierarchy). We study the decidability and complexity of these fragments. We prove that even the ∆2 level is undecidable and that Σ1 is Expspace-complete. We also prove that the arity-bounded fragment of Σ1 is complete for co-Nexptime.

متن کامل

On the second order first zagreb index

Inspired by the chemical applications of higher-order connectivity index (or Randic index), we consider here the higher-order first Zagreb index of a molecular graph. In this paper, we study the linear regression analysis of the second order first Zagreb index with the entropy and acentric factor of an octane isomers. The linear model, based on the second order first Zag...

متن کامل

On the Boundedness Problem for Two-Variable First-Order Logic

A positive rst-order formula is bounded if the sequence of its stages converges to the least xed point of the formula within a xed nite number of steps independent of the input structure. The boundedness problem for a fragment L of rst-order logic is the following decision problem: given a positive formula in L, is it bounded? In this paper, we investigate the boundedness problem for two-variab...

متن کامل

On the decision problem for two-variable first-order logic

We identify the computational complexity of the satisfiability problem for FO, the fragment of first-order logic consisting of all relational first-order sentences with at most two distinct variables. Although this fragment was shown to be decidable a long time ago, the computational complexity of its decision problem has not been pinpointed so far. In 1975 Mortimer proved that FO has the finit...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: ACM Transactions on Computational Logic

سال: 2015

ISSN: 1529-3785,1557-945X

DOI: 10.1145/2733376